| Name | Version | Summary | date |
| byte-prefix-tree |
0.3.1 |
Tries with byte sequences as keys for Python and Rust |
2025-01-21 14:57:08 |
| triesus |
0.6.1 |
Find the Smallest Unique Subset (SUS), fast |
2025-01-16 16:32:18 |
| triematch |
0.0.1rc0 |
Fast lookup for string patterns using Trie, Radix & Aho-Corasick algorithms |
2025-01-08 14:34:31 |
| lib-cidr-trie |
1.2.8 |
Contains a trie of prefixes for fast lookups |
2024-11-23 11:31:42 |
| roa-checker |
3.1.2 |
Fast prefix origin pair lookups |
2024-11-23 11:30:27 |
| actrie |
3.3.0 |
Aho-Corasick automation for large-scale multi-pattern matching. |
2024-10-29 12:12:01 |
| pystrukts |
1.0.0 |
Advanced data structures for Python. |
2024-10-26 10:16:07 |
| blitztext |
0.1.1 |
A library for fast keyword extraction and replacement in strings. |
2024-08-13 08:14:56 |
| remerkleable |
0.1.28 |
Typed mutable SSZ views over cached and immutable binary merkle trees |
2024-06-16 03:16:47 |
| pyahocorasick |
2.1.0 |
pyahocorasick is a fast and memory efficient library for exact or approximate multi-pattern string search. With the ``ahocorasick.Automaton`` class, you can find multiple key string occurrences at once in some input text. You can use it as a plain dict-like Trie or convert a Trie to an automaton for efficient Aho-Corasick search. And pickle to disk for easy reuse of large automatons. Implemented in C and tested on Python 3.6+. Works on Linux, macOS and Windows. BSD-3-Cause license. |
2024-03-21 13:28:27 |